Introduction to Infinite Ramsey Theory
نویسنده
چکیده
In combinatorics, Ramsey Theory considers partitions of some mathematical objects and asks the following question: how large must the original object be in order to guarantee that at least one of the parts in the partition exhibits some property? Perhaps the most familiar case is the well-known Pigeonhole Principle: if m pigeonholes house p pigeons where p m, then one of the pigeonholes must contain multiple pigeons. Conversely, the number of pigeons must exceed m in order to guarantee this property.
منابع مشابه
AN INTRODUCTION TO THE THEORY OF DIFFERENTIABLE STRUCTURES ON INFINITE INTEGRAL DOMAINS
A special class of differentiable functions on an infinite integral domain which is not a field is introduced. Some facts about these functions are established and the special case of z is studied in more detail
متن کاملMaking All Cardinals Almost Ramsey ∗ † ‡ Arthur
We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ¬ACω in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular c...
متن کاملiii Contents Preface
Preface These are the notes based on the course on Ramsey Theory taught at Univer-sität Hamburg in Summer 2011. The lecture was based on the textbook " Ramsey theory " of Graham, Rothschild, and Spencer [44]. In fact, large part of the material is taken from that book. iii Contents Preface iii Chapter 1. Introduction 1 1.1. A few cornerstones in Ramsey theory 1 1.2. A unifying framework 4 1.3. ...
متن کاملNon-bipartite pairs of 33-connected graphs are highly Ramsey-infinite
A pair of graphs (Hb,Hr) is highly Ramsey-infinite if there is some constant c such that for large enough n there are at least 2cn 2 non-isomorphic graphs on n or fewer vertices that are minimal with respect to the property that when their edges are coloured blue or red, there is necessarily a blue copy of Hb or a red copy of Hr. We show that a pair of 3-connected graphs is highly Ramsey-infini...
متن کاملReducts of Ramsey structures
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the endomorphism monoid, or the polymorphism clone of a structure. Such functions can be particularly well understood when the relational structure is countably infin...
متن کامل